Fast Converging Anytime Model Counting

نویسندگان

چکیده

Model counting is a fundamental problem which has been influential in many applications, from artificial intelligence to formal verification. Due the intrinsic hardness of model counting, approximate techniques have developed solve real-world instances counting. This paper designs new anytime approach called PartialKC for The idea form partial knowledge compilation provide an unbiased estimate count can converge exact count. Our empirical analysis demonstrates that achieves significant scalability and accuracy over prior state-of-the-art counters, including satss STS. Interestingly, results show reaches convergence therefore provides performance comparable counters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristics for Fast Exact Model Counting

An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean matrix. We recently introduced Cachet, an exact model-counting algorithm that combines formula caching, clause learning, and component analysis. This paper reports on experiments with various techniques for improving the...

متن کامل

Fast Probabilistic Planning through Weighted Model Counting

We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF to problems with probabilistic uncertainty about both the initial state and action effects. Specifically, Probabilistic-FF combines Conformant-FF’s techniques with a powerful machinery for weighted model counting in ...

متن کامل

Designing fast converging phylogenetic methods

Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomially in the number of leaves, once the edge lengths are bounded arbitrarily from above and below. Only a few methods have been determined to be absolute fast converging; these have all been developed in just the last few years,...

متن کامل

Fast Image Alignment Using Anytime Algorithms

Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often guided by similarity measures between images, computed based on the image data. However, in time-critical applications state-of-the-art methods for computing similarity are too slow. Instead of using all the image data to compute similarity, one can use a subse...

متن کامل

Fast Converging Layered Adaptive Beam Forming Algorithm

LMS algorithm is simple and is well suited for continuous transmission systems since it is a continuously adaptive algorithm. However, it is not known for its convergence speed in the presence of Gaussian, spatially white, of null mean and variance which has prompted people to use other complicated algorithms. In the above scenario LMS has maximum mean square error and minimum error stability. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i4.25517